Virtual Machine Replica Placement Using a Multiobjective Genetic Algorithm

نویسندگان

چکیده

Virtual machine (VM) replication is a critical task in any cloud computing platform to ensure the availability of service for end user. In this task, one primary VM resides on physical (PM) and or more replicas reside separate PMs. computing, placement (VMP) well-studied problem terms different goals, such as power consumption reduction. The VMP can be solved by using heuristics, namely, first-fit meta-heuristics genetic algorithm. Despite extensive research into problem, there are few works that consider when choosing VMP. context, we proposed studying optimal considering requirements. work frames at hand multiobjective adapts nondominated sorting algorithm (NSGA-III) address problem. replicas’ should several dimensions geographical distance between PM hosting other PMs replicas. addition, end, model aims minimize (1) consumption, (2) performance degradation, (3) its replica(s). method thoroughly tested variety environments with various heterogeneous VMs PMs, including compute-intensive memory-intensive environments. obtained results illustrate disparity adapted NSGA-III MOEA/D methods comparison, heuristic meta-heuristic approaches, outperforming comparison methods. For instance, environments, method’s was superior first-fit, next-fit, best-fit, PSO, 58%, 62%, 64%, 55%, 31%, respectively.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Availability-Aware Energy-Efficient Virtual Machine Placement Algorithm

—Availability, as a part of Service Level Agreement (SLA), is a critically important issue in cloud services, which are affected by server or network failures in datacenters. Cloud service providers seek to not only fulfill the SLA, but also simultaneously minimize their operating costs, which are dominated by the energy consumption. In order to minimize the impact of a server/switch failure o...

متن کامل

Which is the best algorithm for virtual machine placement optimization?

One of the key problems for Infrastructure-as-a-Service providers is finding the optimal allocation of virtual machines (VMs) on the physical machines available in the provider’s data center. Since the allocation has significant impact on operational costs as well as on the performance of the accommodated applications, several algorithms have been proposed for the VM placement problem. So far, ...

متن کامل

Energy-Efficient Virtual Machine Placement in Data Centers by Genetic Algorithm

Server consolidation using virtualization technology has become an important technology to improve the energy e ciency of data centers. Virtual machine placement is the key in the server consolidation. In the past few years, many approaches to the virtual machine placement have been proposed. However, existing virtual machine placement approaches to the virtual machine placement problem conside...

متن کامل

Multiobjective Genetic Based Algorithm

In this paper, a novel approach based on handling constraints as objectives together with a modified Parks & Miller elitist technique, to solve constrained multiobjective optimization problems, is analyzed with Niched Pareto Genetic Algorithm. The performance of this approach is compared with the classical procedure of handling constraints that is the exterior penalty function method. Results a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Intelligent Systems

سال: 2023

ISSN: ['1098-111X', '0884-8173']

DOI: https://doi.org/10.1155/2023/8378850